2

Submodular Approximation: Sampling-based Algorithms and Lower Bounds

Year:
2011
Language:
english
File:
PDF, 314 KB
english, 2011
3

Quickest Flows Over Time

Year:
2007
Language:
english
File:
PDF, 316 KB
english, 2007
10

Universally maximum flow with piecewise-constant capacities

Year:
2001
Language:
english
File:
PDF, 260 KB
english, 2001
13

Linear tolls suffice: New bounds and algorithms for tolls in single source networks

Year:
2005
Language:
english
File:
PDF, 206 KB
english, 2005
15

Fast and simple approximation schemes for generalized flow

Year:
2002
Language:
english
File:
PDF, 217 KB
english, 2002
16

A faster capacity scaling algorithm for minimum cost submodular flow

Year:
2002
Language:
english
File:
PDF, 217 KB
english, 2002
22

Strict Cost Sharing Schemes for Steiner Forest

Year:
2010
Language:
english
File:
PDF, 267 KB
english, 2010
24

Faster Algorithms for the Quickest Transshipment Problem

Year:
2001
Language:
english
File:
PDF, 216 KB
english, 2001
31

A Stackelberg strategy for routing flow over time

Year:
2013
Language:
english
File:
PDF, 759 KB
english, 2013
40

Optimal Rounding of Instantaneous Fractional Flows Over Time

Year:
2000
Language:
english
File:
PDF, 117 KB
english, 2000
47

A competitive strategy for routing flow over time

Year:
2011
Language:
english
File:
PDF, 266 KB
english, 2011